Lower bounds and algorithms for the 2-dimensional vector packing problem
نویسندگان
چکیده
منابع مشابه
Lower bounds and algorithms for the 2-dimensional vector packing problem
Given n items, each having, say, a weight and a length, and n identical bins with a weight and a length capacity, the 2-Dimensional Vector Packing Problem (2-DVPP) calls for packing all the items into the minimum number of bins. The problem is NP-hard, and has applications in loading, scheduling and layout design. As for the closely-related Bin Packing Problem (BPP), there are two main possible...
متن کاملA Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کاملThe two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case
The Two-Dimensional Finite Bin Packing Problem (2BP) consists of determining the minimum number of large identical rectangles, bins, that are required for allocatingwithout overlapping a given set of rectangular items. The items are allocated into a bin with their edges always parallel or orthogonal to the bin edges. The problem is strongly NP-hard and finds many practical applications. In this...
متن کاملNew Lower Bounds for the Three-dimensional Orthogonal Bin Packing Problem
In this paper, we consider the three-dimensional orthogonal bin packing problem, which is a generalization of the well-known bin packing problem. We present new lower bounds for the problem and demonstrate that they improve the best previous results. The asymptotic worst-case performance ratio of the lower bounds is also proved. In addition, we study the non-oriented model, which allows items t...
متن کاملA Computational Study of Lower Bounds for the Two Dimensional Bin Packing Problem
We survey lower bounds for the variant of the two-dimensional bin packing problem where items cannot be rotated. We prove that the dominance relation claimed by Carlier et al.[5] between their lower bounds and those of Boschetti and Mingozzi [1] is not valid. We analyze the performance of lower bounds from the literature and we provide the results of a computational experiment.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2001
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(00)00267-5